A Parameterized Floating-Point Formalizaton in HOL Light
نویسندگان
چکیده
We present a new, open-source formalization of fixed and floating-point numbers for arbitrary radix and precision that is now part of the HOL Light distribution [10]. We prove correctness and error bounds for the four different rounding modes, and formalize a subset of the IEEE 754 [1] standard by gluing together a set of fixed-point and floating-point numbers to represent the subnormals and normals. In our floating-point proofs, we treat phases of floating-point numbers as copies of fixed-point numbers of varying precision so that we can reuse fixed-point rounding theorems.
منابع مشابه
Floating-Point Verification Using Theorem Proving
This chapter describes our work on formal verification of floating-point algorithms using the HOL Light theorem prover.
متن کاملA Formal Model of IEEE Floating Point Arithmetic
This development provides a formal model of IEEE-754 floatingpoint arithmetic. This formalization, including formal specification of the standard and proofs of important properties of floating-point arithmetic, forms the foundation for verifying programs with floating-point computation. There is also a code generation setup for floats so that we can execute programs using this formalization in ...
متن کاملFloating Point Verification in HOL Light: The Exponential Function
Since they often embody compact but mathematically sophisticated algorithms , operations for computing the common transcendental functions in oating point arithmetic seem good targets for formal veriication using a mechanical theorem prover. We discuss some of the general issues that arise in veriications of this class, and then present a machine-checked veriication of an algorithm for computin...
متن کاملHierarchical Verification of the Implementation of The IEEE-754 Table-Driven Floating-Point Exponential Function using HOL
The IEEE-754 floating-point standard, used in nearly all floating-point applications, is considered one of the most important standards. Deep datapath and algorithm complexity have made the verification of such floating-point units a very hard task. Most simulation and reachability analysis verification tools fail to verify a circuit with a deep datapath like most industrial floating-point unit...
متن کاملFormal Verification of IA-64 Division Algorithms
The IA-64 architecture defers floating point and integer division to software. To ensure correctness and maximum efficiency, Intel provides a number of recommended algorithms which can be called as subroutines or inlined by compilers and assembly language programmers. All these algorithms have been subjected to formal verification using the HOL Light theorem prover. As well as improving our lev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 317 شماره
صفحات -
تاریخ انتشار 2015